Verified Quadratic Virtual Substitution for Real Arithmetic

نویسندگان

چکیده

This paper presents a formally verified quantifier elimination (QE) algorithm for first-order real arithmetic by linear and quadratic virtual substitution (VS) in Isabelle/HOL. The Tarski-Seidenberg theorem established that the logic of is decidable QE. However, practice, QE algorithms are highly complicated often combine multiple methods performance. VS practically successful method targets formulas with low-degree polynomials. To our knowledge, this first work to formalize including inequalities. proofs necessitate various contributions existing multivariate polynomial libraries Our framework modularized easily expandable (to facilitate integrating future optimizations), could serve as basis developing practical general-purpose algorithms. Further, formalization designed practicality mind, we export development SML test resulting code on 378 benchmarks from literature, comparing Redlog, Z3, Wolfram Engine, SMT-RAT. identified inconsistencies some tools, underscoring significance approach intricacies arithmetic.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture Notes on Virtual Substitution & Real Arithmetic

Reasoning about cyber-physical systems and hybrid systems requires understanding and handling their real arithmetic, which can be challenging, because cyber-physical systems can have complex behavior. Differential dynamic logic and its proof calculus [Pla08, Pla10, Pla12] reduce the verification of hybrid systems to real arithmetic. How arithmetic interfaces with proofs has already been discuss...

متن کامل

Essential Incompleteness of Arithmetic Verified by Coq

A constructive proof of the Gödel-Rosser incompleteness theorem [9] has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive functions is given, and all primitive recursive functions are proved to be representable in a weak axiom system. Formulas and proofs are encoded as natural n...

متن کامل

Arithmetic of Quadratic Forms

has a solution in Fn. The representation problem of quadratic forms is to determine, in an effective manner, the set of elements of F that are represented by a particular quadratic form over F . We shall discuss the case when F is a field of arithmetic interest, for instance, the field of complex numbers C, the field of real numbers R, a finite field F, and the field of rational numbers Q. The ...

متن کامل

Navigation Using Sensory Substitution in Real and Virtual Mazes

Under certain specific conditions people who are blind have a perception of space that is equivalent to that of sighted individuals. However, in most cases their spatial perception is impaired. Is this simply due to their current lack of access to visual information or does the lack of visual information throughout development prevent the proper integration of the neural systems underlying spat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-90870-6_11